A Mixture Model for Expert Finding

نویسندگان

  • Jing Zhang
  • Jie Tang
  • Liu Liu
  • Juan-Zi Li
چکیده

This paper addresses the issue of identifying persons with expertise knowledge on a given topic. Traditional methods usually estimate the relevance between the query and the support documents of candidate experts using, for example, a language model. However, the language model lacks the ability of identifying semantic knowledge, thus results in some right experts cannot be found due to not occurrence of the query terms in the support documents. In this paper, we propose a mixture model based on Probabilistic Latent Semantic Analysis (PLSA) to estimate a hidden semantic theme layer between the terms and the support documents. The hidden themes are used to capture the semantic relevance between the query and the experts. We evaluate our mixture model in a real-world system, ArnetMiner. Experimental results indicate that the proposed model outperforms the language models.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Probabilistic Models for Expert Finding

A common task in many applications is to find persons who are knowledgeable about a given topic (i.e., expert finding). In this paper, we propose and develop a general probabilistic framework for studying expert finding problem and derive two families of generative models (candidate generation models and topic generation models) from the framework. These models subsume most existing language mo...

متن کامل

کاربست مدل‌ بازیابی تخصص برای یافتن نویسندگان خبره

This research applied Expertise Retrieval model for finding expert authors, and used evaluation methods of Information Retrieval systems for measuring the performance of those models. Current research is an experimental one. Besides, a variety of methods including survey method has been used in the research process. Various models were developed for finding expert authors, all built on a known ...

متن کامل

Expert Finding using discriminative infinite Hidden Markov Model

Process of finding the right expert for a given problem in an organization is becoming feasible. Using web surfing data it is feasible to find advisor who is most likely possessing the desired piece of fine grained knowledge related with given query. Web surfing data is clustered into tasks by using Gaussian Dirichlet process mixture model. In order to mine micro aspects in each task a novel di...

متن کامل

Language Models for Expert Finding--UIUC TREC 2006 Enterprise Track Experiments

In this paper, we report our experiments in the TREC 2006 Enterprise Track. Our focus is to study a language model for expert finding. We extend an existing language model for expert retrieval in three aspects. First, we model the document-expert association using a mixure model instead of name matching heuristics as in the existing work; such a mixture model allows us to put different weights ...

متن کامل

­­Image Segmentation using Gaussian Mixture Model

Abstract: Stochastic models such as mixture models, graphical models, Markov random fields and hidden Markov models have key role in probabilistic data analysis. In this paper, we used Gaussian mixture model to the pixels of an image. The parameters of the model were estimated by EM-algorithm.   In addition pixel labeling corresponded to each pixel of true image was made by Bayes rule. In fact,...

متن کامل

Automatizing the Assignment of the Submitted Manuscripts to Reviewers: A Systematic Review of Research Texts

Purpose: To systematicly review the automatazation of the assignment of the submitted manuscripts to reviewers in order to identify the status of research studies in this field in terms of types of evidence of expertise, types of retrieval models used, and the research gaps, and finally some suggestions for has been offered for future research. Method: The current research followed the systema...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008